Conflict-free Covering
نویسندگان
چکیده
Let P = {C1, C2, . . . , Cn} be a set of color classes, where each color class Ci consists of a set of points. In this paper, we address a family of covering problems, in which one is allowed to cover at most one point from each color class. We prove that the problems in this family are NP-complete (or NP-hard) and offer several constant-factor approximation algorithms.
منابع مشابه
Dynamic Offline Conflict-Free Coloring for Unit Disks
A conflict-free coloring for a given set of disks is a coloring of the disks such that for any point p on the plane there is a disk among the disks covering p having a color different from that of the rest of the disks that covers p. In the dynamic offline setting, a sequence of disks is given, we have to color the disks one-by-one according to the order of the sequence and maintain the conflic...
متن کاملConflict-Free Coloring Made Stronger
In FOCS 2002, Even et al. showed that any set of n discs in the plane can be Conflict-Free colored with a total of at most O(log n) colors. That is, it can be colored with O(log n) colors such that for any (covered) point p there is some disc whose color is distinct from all other colors of discs containing p. They also showed that this bound is asymptotically tight. In this paper we prove the ...
متن کاملPerformance of a greedy algorithm for edge covering by cliques in interval graphs
In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analysed. In a graph, a stable set requires that at most one vertex is chosen for each edge. It is equivalent to requiring that at most one vertex for each maximal clique is chosen. We show that this algorithm finds all maximal cliques for interval graphs, i.e. it can compute the convex hul...
متن کاملCovering Segments with Unit Squares
We study several variations of line segment covering problem with axis-parallel unit squares in IR. A set S of n line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give...
متن کاملEarly Marriage and Barriers to Contraception among Syrian Refugee Women in Lebanon: A Qualitative Study
The Syrian conflict has displaced five million individuals outside their country with Lebanon hosting the largest numbers per capita. Around 24% of Syrian refugees fleeing to Lebanon are women of reproductive age (15-49). Yet, a better understanding of the sexual and reproductive health needs of Syrian refugee women in Lebanon is required to improve provided services. Eleven focus group discuss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015